Concerning a bound problem in knot theory

Knot Theory

Problems in Knot Theory

Banff Workshop Proposal: Knot Theory and Virtual Knot Theory

1.

Concerning a Bound on Undetected Error Probability

In the past, it has generally been assumed that the prohability of undetected error for an (n,k) block code, used solely for error detection on a binary symmetric channel, is upperbounded by 2-‘“-k’. In this correspondence, it is shown that Hamming codes do indeed obey this bound, but that the bound is violated by some more general codes. Examples of linear, cyclic, and Bose-Chaudhuri-Hocquengh...

A bound concerning primordial non-gaussianity

Seery and Lidsey have calculated the three-point correlator of the light scalar fields, a few Hubble times after horizon exit during inflation. Lyth and Rodriguez have calculated the contribution of this correlator to the three-point correlator of the primordial curvature perturbation. We calculate an upper bound on that contribution, showing that it is too small ever to be observable. Introduc...